Ordered Binary Decision Diagrams and Their Signi cance inComputer
نویسندگان
چکیده
Electronic copies of technical reports are available: Via FTP: URL ftp://ftp.informatik.uni-trier.de/pub/Users-Root/reports Via WWW: URL http://www.informatik.uni-trier.de/Reports/Current.html Via email: Send a mail to [email protected], subject ’HELP’, for detailed instructions Printed copies: Trierer Forschungsberichte Fachbereich IV Mathematik / Informatik Universitat Trier ..
منابع مشابه
Function-driven Linearly Independent Expansions of Boolean Functions
The paper presents a family of new expansions of Boolean functions called Function-driven Linearly Independent (fLI) expansions. On the basis of this expansion a new kind of a canonical representation of Boolean functions is constructed: Function-driven Linearly Independent Binary Decision Diagrams (fLIBDDs). They generalize both Function-driven Shannon Binary Decision Diagrams (fShBDDs) and Li...
متن کاملQuantum Ordered Binary Decision Diagrams with Repeated Tests
Quantum branching programs (quantum binary decision diagrams, respectively) are a convenient tool for examining quantum computations using only a logarithmic amount of space. Recently several types of restricted quantum branching programs have been considered, e. g. read–once quantum branching programs. This paper considers quantum ordered binary decision diagrams (QOBDDs) and answers the quest...
متن کاملDynamic minimization of OKFDDs
We present methods for the construction of small Ordered Kronecker Functional Decision Diagrams (OKFDDs). OKFDDs are a generalization of Ordered Binary Decision Diagrams (OBDDs) and Ordered Functional Decision Diagrams (OFDDs) as well. Our approach is based on dynamic variable ordering and decomposition type choice. For changing the decomposition type we use a new method. We brieey discuss the ...
متن کاملFree Kronecker Decision Diagrams and their Application to Atmel 6000 FPGA Mapping
This paper introduces the concepts of PseudoKronecker Decision Diagrams (PKDDs) with Negated Edges, as well as Free Kronecker Decision Diagrams (FKDDs), that generalize both the well-known Binary Decision Diagrams and Functional Decision Diagrams, as well as the recently introduced Ordered Kronecker Decision Diagrams (OKDDs). We give e cient algorithm for the generation of FKDDs for multi-outpu...
متن کاملFrankfurt am Main , March 1995 Dynamic Minimization of OKFDDs
We present methods for the construction of small Ordered Kronecker Functional Decision Diagrams (OKFDDs). OKFDDs are a generalization of Ordered Binary Decision Diagrams (OBDDs) and Ordered Functional Decision Diagrams (OFDDs) as well. Our approach is based on dynamic variable ordering and decomposition type choice. For changing the decomposition type we use a new more eecient method. The quali...
متن کامل